Visual Analytics Evaluation Based on Judgment Analysis Theory

In this paper we propose a framework to quantitatively evaluate user awareness and the level of support that visual analytics decision support systems (VADS) provide. For the framework, which has a theoretical underpinning from the field of judgement analysis, we propose a model for VADS system. The framework bridges the gap between judgment analysis and VADS evaluation by conceptually connecting judgment analysis concepts to visual analytic. The proposed approach offers an insights based evaluation to measure the importance and the utility of the insights. We propose to model insights and user findings as random variables that parametrize user decisions. The mixed methodology used in our framework has the potential to study user decision process in real situations while producing results that can be generalized. Our contributions in this work appear in the modeling of VADS system and the evaluation framework we propose which quantifies situation awareness. Other advantages include evaluating collaboration and analyzing joint decisions. Some limitations of the framework are also discussed including the requirement of large testing data

Performance Tradeoffs for Scheduling pre-orchestrated Multimedia Information Over Broadband Integrated Networks

In this report we present a framework for evaluating performance of scheduling preorchestrated multimedia information over broadband integrated networks. We propose a set of Quality Of Presentation (QOP) parameters which quantify the quality of multimedia presentation from user\u27s point of view. The communication of mulltimedia data in a networked environment can affect the desired QOP parameters due to jitter delays in the network. We evaluate trade-offs between QOP parameters and the system resources including channel utilization and buffering at the destination. These trade-offs can be used to develope an optimal transmission schedule for multimedia information

Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems

This paper presents a semi-distributed approach, for load balancing in large parallel and distributed systems, which is different from the conventional centralized and fully distributed approaches. The proposed strategy uses a two-level hierarchical control by partitioning the interconnection structure of a distributed or multiprocessor system into independent symmetric regions (spheres) centered at some control points. The central points, called schedulers, optimally schedule tasks within their spheres and maintain state information with low overhead. We consider interconnection structures belonging to a number of families of distance transitive graphs for evaluation, and using their algebraic characteristics, show that identification of spheres and their scheduling points is, in general, an NP-complete problem. An efficient solution for this problem is presented by making an exclusive use of a combinatorial structure known as the Hadamard Matrix. Performance of the proposed strategy has been evaluated and compared with an efficient fully distributed strategy, through an extensive simulation study. In addition to yielding high performance in terms of response time and better resource utilization, the proposed strategy incurs less overhead in terms of control messages. It is also shown to be less sensitive to the communication delay of the underlying network

A Graph-Based Model for Component-Based Software Development

Software metrics can be used to objectively quantify the quality of software components and systems, alleviating quality and risk concerns and raising assurance in component-based systems. In this paper, we present a graph-based model for component-based software development. We assume that a number of components have been characterized in terms of non-functional metrics of importance to the software system being developed, and that the interfaces connecting various components have been similarly characterized. The emphasis of this work is on cost and quality of the system under development, and reaching an acceptable compromise between the two

Fault-Tolerant Load Management for Real-Time Distributed Computer Systems

This paper presents a fault-tolerant scheme applicable to any decentralized load balancing algorithms used in soft real-time distributed systems. Using the theory of distance-transitive graphs for representing topologies of these systems, the proposed strategy partitions these systems into independent symmetric regions (spheres) centered at some control points. These central points, called fault-control points, provide a two-level task redundancy and efficiently re-distribute the load of failed nodes within their spheres. Using the algebraic characteristics of these topologies, it is shown that the identification of spheres and fault-control points is, in general, is an NP-complete problem. An efficient solution for this problem is presented by making an exclusive use of a combinatorial structure known as the Hadamard matrix. Assuming a realistic failure-repair system environment, the performance of the proposed strategy has been evaluated and compared with no fault environment, through an extensive and detailed simulation. For our fault-tolerant strategy, we propose two measures of goodness, namely, the percentage of re-scheduled tasks which meet their deadlines and the overhead incurred for fault management. It is shown that using the proposed strategy, up to 80% of the tasks can still meet their deadlines. The proposed strategy is general enough to be applicable to many networks, belonging to a number of families of distance transitive graphs. Through simulation, we have analyzed the sensitivity of this strategy to various system parameters and have shown that the performance degradation due to failures does not depend on these parameter. Also, the probability of a task being lost altogether due to multiple failures has been shown to be extremely low

Role of Celebrity Endorsement and Consumers’ Perception towards Media Advertisements

The objective of the study is to determine celebrity endorsements' effectiveness through various media. The study is to find out what are the core characteristics of the celebrity which make him/her more credible, on the basis of which, business' may select a better celebrity to promote their brand. The other aspect related to it is selection of media; which media can be preferred if the celebrity endorsement is used. The study is qualitative type of study which was conducted through the questionnaire. The questionnaire is exposed to 250 residents of Multan city. On this basis, analysis was done. The study found that expertise, sense of style and familiarity are core characteristics along with trustworthiness which determine the celebrity’s overall credibility. Celebrity's credibility, relevance with brand, his/her attitude towards brand and media selection as Television contribute toward the effectiveness of celebrity endorsement.                                                                                                                                Keywords:Celebrity Endorsement, Expertise, Trustworthiness, Sense of style, Familiarity, Celebrity’s Credibility, Relevance with Brand, Attitude toward Brand, Media selectio